#define _CRT_SECURE_NO_WARNINGS 1

#include "BinarySearchTree.h"

int main()
{
	int arr[] = { 8,3,2,4,10 };
	BSTree<int> s;
	for (size_t i = 0; i < sizeof(arr) / sizeof(int); i++)
	{
		s.Insert(arr[i]);
	}

	s.preOrder();
	cout << endl;

	s.EraseR(3);
	s.preOrder();
	cout << endl;
	return 0;
}